Sample Complexity of Solving Non-Cooperative Games

Lower Bounds on the Complexity of Solving Two Classes of Non-cooperative Games

This paper studies the complexity of solving two classes of non-cooperative games in a distributed manner in which the players communicate with a set of system nodes over noisy communication channels. The complexity of solving each game class is defined as the minimum number of iterations required to find a Nash equilibrium (NE) of any game in that class with ǫ accuracy. First, we consider the ...

Solving Cooperative Reliability Games

Cooperative games model the allocation of profit from joint actions, following considerations such as stability and fairness. We propose the reliability extension of such games, where agents may fail to participate in the game. In the reliability extension, each agent only “survives” with a certain probability, and a coalition’s value is the probability that its surviving members would be a win...

Non-cooperative Games

Non-cooperative games are mathematical models of interactive strategic decision situations. In contrast to cooperative models, they build on the assumption that all possibilities for commitment and contract have been incorporated in the rules of the game. This contribution describes the main models (games in normal form, and games in extensive form), as well as the main concepts that have been ...

Non-Cooperative Bundling Games

Bundling is a basic problem in commerce. We define and study the Bundling Game: each of n players with a unique product to sell can choose to sell their products in bundles with other players’ products so as to maximize their payoff; the players all have knowledge of the valuations of m (potential) buyers for each of the products. We define two natural classes of payoff functions Fair Profit Sh...

Foundations of Non-cooperative Games